Iwasawa theory for $$\mathrm {GL}_2\times \mathrm {Res}_{K/\mathbb {Q}}\mathrm {GL}_1$$

نویسندگان

چکیده

Let K be an imaginary quadratic field where the prime p splits. Our goal in this article is to prove results towards Iwasawa main conjectures for p-nearly-ordinary families associated $$\mathrm {GL}_2\times \mathrm {Res}_{K/\mathbb {Q}}\mathrm {GL}_1$$ with a minimal set of assumptions. The technical input improvement on locally restricted Euler system machinery that allows treatment residually reducible cases, which we apply Beilinson–Flach system.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modal $\mathrm{I}\mathrm{n}\mathrm{t}\mathrm{u}\mathrm{i}\mathrm{t}\mathrm{i}\mathrm{o}\mathrm{n}\tilde{\mathrm{l}}\mathrm{s}\mathrm{t}\mathrm{i}\mathrm{C}$ Logics and Predicate Superintuitionistic Logics: $\mathrm{C}_{0\Gamma \mathrm{r}\mathrm{e}..\mathrm{S}},\mathrm{p}$

In this note we deal with intuitionistic modal logics over $\mathcal{M}\mathcal{I}PC$ and predicate superintuitionistic logics. We study the correspondence between the lattice of all (normal) extensions of MTPC and the lattice of all predicate superintuitionistic logics. Let $\mathrm{L}_{Prop}$ denote a propositional language which contains two modal operators $\square$ and $\mathrm{O}$ , and $...

متن کامل

$\mathrm{Pal}^k$ Is Linear Recognizable Online

Given a language L that is online recognizable in linear time and space, we construct a linear time and space online recognition algorithm for the language L ·Pal, where Pal is the language of all nonempty palindromes. Hence for every fixed positive k, Pal is online recognizable in linear time and space. Thus we solve an open problem posed by Galil and Seiferas in 1978.

متن کامل

Approximately Counting H-Colorings is $\#\mathrm{BIS}$-Hard

We examine the computational complexity of approximately counting the list H-colourings of a graph. We discover a natural graph-theoretic trichotomy based on the structure of the graph H . If H is an irreflexive bipartite graph or a reflexive complete graph then counting list H-colourings is trivially in polynomial time. Otherwise, if H is an irreflexive bipartite permutation graph or a reflexi...

متن کامل

Fuzzy Graph Rewritings

This paper presents fuzzy graph rewriting systems with fuzzy relational calculus. In this paper fuzzy graph means crisp set of vetices and fuzzy set of edges. We provide $\mathrm{f}\mathrm{u}\mathrm{z},7,\mathrm{y}$ relational calculus witll Heyting algebra. Formalizing rewriting system of fuzzy graphs it is important to $\mathrm{c}\cdot 1_{1\mathrm{t})\mathrm{t}}.\mathrm{q}\mathrm{C}1$ how to ...

متن کامل

Vector Reachability Problem in $\mathrm{SL}(2,\mathbb{Z})$

This paper is showing the solution for two open problems about decidability of vector reachability problem in a finitely generated semigroup of matrices from SL(2,Z) and the point to point reachability (over rational numbers) for fractional linear transformations, where associated matrices are form SL(2,Z). The approach of solving reachability problems is based on analysis of reachability paths...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annales Mathématiques Du Québec

سال: 2022

ISSN: ['2195-4755', '2195-4763']

DOI: https://doi.org/10.1007/s40316-022-00197-7